Dependency Schemes in QBF Calculi: Semantics and Soundness
نویسندگان
چکیده
We study the parametrization of QBF resolution calculi by dependency schemes. One of the main problems in this area is to understand for which dependency schemes the resulting calculi are sound. Towards this end we propose a semantic framework for variable independence based on ‘exhibition’ by QBF models, and use it to define a property of dependency schemes called full exhibition. We prove that all CDCL-based resolution calculi, including Q-resolution, universal and long-distance Q-resolution, are sound when parametrized by a fully exhibited dependency scheme. To illustrate proof of concept, we show that the standard dependency scheme is fully exhibited.
منابع مشابه
Shortening QBF Proofs with Dependency Schemes
We provide the first proof complexity results for QBF dependency calculi. By showing that the reflexive resolution path dependency scheme admits exponentially shorter Q-resolution proofs on a known family of instances, we answer a question first posed by Slivovsky and Szeider in 2014 [30]. Further, we conceive a method of QBF solving in which dependency recomputation is utilised as a form of in...
متن کاملThird International Workshop on Quantified Boolean Formulas (QBF 2015)
3 Contributions 3 3.1 Friedrich Slivovsky : Dependency Schemes for Quantified Boolean Formulas (Invited Talk) . . . . . . . . . . . . . . . . . . . . . 3 3.2 Olaf Beyersdorff, Leroy Chew, Meena Mahajan and Shukla Anil : Feasible Interpolation for QBF Resolution Calculi . . . 4 3.3 Valeriy Balabanov, Jie-Hong Roland Jiang and Christoph Scholl : Skolem functions computation for CEGAR based QBF so...
متن کاملFormulas with Large Weight: a New Technique for Genuine QBF Lower Bounds
We devise a new technique to prove lower bounds for the proof size in resolutiontype calculi for quantified Boolean formulas (QBF). The new technique applies to the strong expansion system IR-calc and thereby also to the most studied QBF system Q-Resolution. Our technique exploits a clear semantic paradigm, showing the hardness of a QBF family by demonstrating that (1) the formulas require larg...
متن کاملDependency Schemes and Search-Based QBF Solving: Theory and Practice
The logic of quantified Boolean formulae (QBF) extends propositional logic with universal quantification over propositional variables. The presence of universal quantifiers in QBF does not add expressiveness, but often allows for more compact encodings of problems. From a theoretical point of view, the decision problems of propositional logic (SAT) and QBF are NP-complete and PSPACE-complete, r...
متن کاملLong Distance Q-Resolution with Dependency Schemes
Resolution proof systems for quantified Boolean formulas (QBFs) provide a formal model for studying the limitations of state-of-the-art search-based QBF solvers that use these systems to generate proofs. We study a proof system that combines two proof systems supported by the solver DepQBF: Q-resolution with generalized universal reduction according to a dependency scheme and long distance Q-re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016